Fast Algorithms for Binary Dilation and Erosion Using Run-Length Encoding
نویسندگان
چکیده
منابع مشابه
Fast algorithms for morphological operations using run-length encoded binary images
This paper presents innovative algorithms to efficiently compute erosions and dilations of run-length encoded (RLE) binary images with arbitrary shaped structuring elements. An RLE image is given by a set of runs, where a run is a horizontal concatenation of foreground pixels. The proposed algorithms extract the skeleton of the structuring element and build distance tables of the input image, w...
متن کاملFast First-Move Queries through Run-Length Encoding
We introduce a novel preprocessing-based algorithm to solve the problem of determining the first arc of a shortest path in sparse graphs. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows and columns i...
متن کاملEfficient Dilation, Erosion, Opening and Closing Algorithms
We propose an efficient and deterministic algorithm for computing the one dimensional dilation and erosion (max and min) sliding window filters. For a p-element sliding window, our algorithm computes the 1D filter using 1:5+o(1) comparisons per sample point. Our algorithm constitutes a deterministic improvement over the best previously known such algorithm, independently developed by van Herk [...
متن کاملRun-length Encoding for Volumetric Texture
With the dramatic increase of 3D imaging techniques, there is a great demand for new approaches in texture analysis of volumetric data. In this paper, we present a new approach for volumetric texture analysis using a runlength encoding matrix and its texture descriptors. We experiment with our approach on the volumetric data generated from two normal Computed Tomography (CT) studies of the ches...
متن کاملEfficient convolution based algorithms for erosion and dilation
Morphological operations based on primitives such as dilation and erosion are slow to compute in practice especially for large structuring elements. For direct implementation of these primitives, the computing time grows exponentially with the size of the structuring element used. The latter renders these implementations impractical for large structuring elements due to a rapid increase in comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETRI Journal
سال: 2005
ISSN: 1225-6463
DOI: 10.4218/etrij.05.0205.0013